Bohdan Zelinka INDEPENDENT SET DOMINATING SETS IN BIPARTITE GRAPHS
نویسنده
چکیده
The paper continues the study of independent set dominating sets in graphs which was started by E. Sampathkumar. A subset D of the vertex set V (G) of a graph G is called a set dominating set (shortly sd−set) in G, if for each set X ⊆ V (G) −D there exists a set Y ⊆ D such that the subgraph 〈X ∪ Y 〉 of G induced by X ∪ Y is connected. The minimum number of vertices of an sd−set in G is called the set domination number γs(G) of G. An sd−set D in G such that |D| = γs(G) is called a γs-set in G. In this paper we study sd−sets in bipartite graphs which are simultaneously independent. We apply the theory of hypergraphs.
منابع مشابه
Strength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملPoint-set Domatic Numbers of Graphs
A subset D of the vertex set V (G) of a graph G is called point-set dominating, if for each subset S ⊆ V (G) − D there exists a vertex v ∈ D such that the subgraph of G induced by S ∪ {v} is connected. The maximum number of classes of a partition of V (G), all of whose classes are point-set dominating sets, is the point-set domatic number dp(G) of G. Its basic properties are studied in the paper.
متن کاملOnline Dominating Set and Variations on Restricted Graph Classes
We study online versions ofMinimum Dominating Set Min imum Connected Dominating Set andMinimum Independent Dom inating Set where we restrict the input graphs to belong to a certain graph class after each insertion step We show that straight forward and easy to implement online strategies achieve optimum or nearly optimum competitive ratios for trees unit disk graphs and bounded degree graphs fo...
متن کاملDominating Set Counting in Graph Classes
We make an attempt to understand the dominating set counting problem in graph classes from the viewpoint of polynomial-time computability. We give polynomial-time algorithms to count the number of dominating sets (and minimum dominating sets) in interval graphs and trapezoid graphs. They are based on dynamic programming. With the help of dynamic update on a binary tree, we further reduce the ti...
متن کامل